A Method Using Inverse Shortest Paths Problem to Estimate Stopover Tourist Destinations Based on Heterogeneity

On the Inverse Shortest Paths Problem

In this paper we survey a variant of the inverse shortest paths problem. Given is a network in which certain node-pairs require connections over specific predefined single paths. The aim is to find link weights such that the desired paths are uniquely induced by a shortest-path algorithm. Further we require that the link weights fit existing shortest-path based routing protocols. We give a moti...

The Inverse Shortest Paths Problem with Upper Bounds on Shortest Paths Costs

We examine the computational complexity of the inverse shortest paths problem with upper bounds on shortest path costs, and prove that obtaining a globally optimum solution to this problem is NP-complete. An algorithm for nding a locally optimum solution is proposed, discussed and tested.

On an instance of the inverse shortest paths problem

Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths

We study the complexity of two Inverse Shortest Paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph, the task is to find positive integer arc lengths such that the given paths are uniquely determined shortest paths between their respective terminals. The first problem seeks for arc lengths that...

An Embedded Connectionist Approach for the Inverse Shortest Paths Problem

The Inverse Shortest Path (ISP) problem has recently been considered for applications involving the precise determination of unknown path costs, given only limited experts' knowledge of some shortest paths. Unlike previous approaches which are usually restrictive (such as the minimum change requirement) and algorithmically complicated, a more general but simple optimization scheme based on embe...